A Lower Bound for the Smallest Singular Value

نویسنده

  • LIMIN ZOU
چکیده

In this paper, we obtain a lower bound for the smallest singular value of nonsingular matrices which is better than the bound presented by Yu and Gu [Linear Algebra Appl. 252(1997)25-38]. Meanwhile, we give some numerical examples which will show the effectiveness of our result.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A parameterized lower bound for the smallest singular value

This paper presents a parameterized lower bound for the smallest singular value of a matrix based on a new Geršgorin-type inclusion region that has been established recently by these authors. The comparison of the new lower bound with known ones is supplemented with a numerical example.

متن کامل

Ela Loewner Matrix Ordering in Estimation of the Smallest Singular Value

Abstract. In this paper, some new lower bounds for the smallest singular value of a square complex matrix A are derived. A key tool to obtain these bounds is using some Hermitian matrices which are, in the sense of Loewner matrix ordering, below the Hermitian part of A or, more generally, below the Hermitian part of the unitary equivalences of A. Two types of new bounds are proposed. The first ...

متن کامل

On the optimality and sharpness of Laguerre's lower bound on the smallest eigenvalue of a symmetric positive definite matrix

Lower bounds on the smallest eigenvalue of a symmetric positive definite matrices A ∈ Rm×m play an important role in condition number estimation and in iterative methods for singular value computation. In particular, the bounds based on Tr(A) and Tr(A) attract attention recently because they can be computed in O(m) work when A is tridiagonal. In this paper, we focus on these bounds and investig...

متن کامل

Probabilistic Bounds for the Matrix Condition Number with Extended Lanczos Bidiagonalization

Reliable estimates for the condition number of a large, sparse, real matrix A are important in many applications. To get an approximation for the condition number κ(A), an approximation for the smallest singular value is needed. Standard Krylov subspaces are usually unsuitable for finding a good approximation to the smallest singular value. Therefore, we study extended Krylov subspaces which tu...

متن کامل

Note on Some Upper Bounds for the Condition Number

In this letter, some lower bounds for the smallest singular value of the nonsingular matrix are established. In addition, we also proposed some upper bounds on the condition number of a matrix which are the better than the bound proposed by Guggenheimer et al. [College Math. J. 26(1) (1995) 2-5]. To illustrate our bounds, some examples are also given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012